Bankruptcy Prediction: Dynamic Geometric Genetic Programming (DGGP) Approach

نویسندگان

  • Ali Arshadi Monetary and Banking Research Institute, Central Bank of the Islamic Republic of Iran
  • Alireza Bahiraie Department of Mathematics, University of Semnan, Iran & Risk Management Unit, Pasargad Bank
چکیده مقاله:

 In this paper, a new Dynamic Geometric Genetic Programming (DGGP) technique is applied to empirical analysis of financial ratios and bankruptcy prediction. Financial ratios are indeed desirable for prediction of corporate bankruptcy and identification of firms’ impending failure for investors, creditors, borrowing firms, and governments. By the time, several methods have been attempted in the use of financial ratios on predicting bankruptcy but some of them suffer from underlying shortcomings. Recently, Genetic Programming (GP) has received great attention in academic and empirical fields of solving high complex problems. The paper proposes the use of Dynamic Risk Space measure (DRS) on bankruptcy prediction utilized with Genetic Programming technique. The paper provides the evidence of the extent to which changes in values of this index are associated with changes in each values axis and how this may alter our economic interpretation of changes in the patterns and direction of risk. Results of Dynamic Geometric Genetic Programming (DGGP) classification methodology is compared with common and transformed ratios. Results confirm the better accuracy which Genetic classification tree achieved (overall 95.14% accuracy rate) using transformed ratios approach while original ratios model achieved only 88.85% accuracy rate. 

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Genetic Programming Decision Tree for Bankruptcy Prediction

In this paper, we apply the CART ,C5.0 , GP decision tree classifiers and compares with logic model and ANN model for Taiwan listed electronic companies bankruptcy prediction. Results reveal that the GP decision tree can outperform all the classifiers either in overall percentage of correct or k-fold cross validation test in out sample. That is to say, GP decision tree model have the highest ac...

متن کامل

A Genetic Programming Approach for Bankruptcy Prediction Using a Highly Unbalanced Database

In this paper we present the application of a genetic programming algorithm to the problem of bankruptcy prediction. To carry out the research we have used a database of Spanish companies. The database has two important drawbacks: the number of bankrupt companies is very small when compared with the number of healthy ones (unbalanced data) and a considerable number of companies have missing dat...

متن کامل

A genetic algorithm-based approach to cost-sensitive bankruptcy prediction

The prediction of bankruptcy is of significant importance with the present-day increase of bankrupt companies. In the practical applications, the cost of misclassification is worthy of consideration in the modeling in order to make accurate and desirable decisions. An effective prediction system requires the integration of the cost preference into the construction and optimization of prediction...

متن کامل

Geometric Semantic Genetic Programming Algorithm and Slump Prediction

Research on the performance of recycled concrete as building material in the current world is an important subject. Given the complex composition of recycled concrete, conventional methods for forecasting slump scarcely obtain satisfactory results. Based on theory of nonlinear prediction method, we propose a recycled concrete slump prediction model based on geometric semantic genetic programmin...

متن کامل

Geometric Semantic Genetic Programming

Traditional Genetic Programming (GP) searches the space of functions/programs by using search operators that manipulate their syntactic representation, regardless of their actual semantics/behaviour. Recently, semantically aware search operators have been shown to outperform purely syntactic operators. In this work, using a formal geometric view on search operators and representations, we bring...

متن کامل

Optimal production and marketing planning with geometric programming approach

One of the primary assumptions in most optimal pricing methods is that the production cost is a non-increasing function of lot-size. This assumption does not hold for many real-world applications since the cost of unit production may have non-increasing trend up to a certain level and then it starts to increase for many reasons such as an increase in wages, depreciation, etc. Moreover, the prod...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 6  شماره None

صفحات  101- 132

تاریخ انتشار 2012-07

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023